Non cooperative Stackelberg network formation
نویسندگان
چکیده
منابع مشابه
Stackelberg network pricing is hard to approximate
In the Stackelberg network pricing problem, one has to assign tariffs to a certain subset of the arcs of a given transportation network. The aim is to maximize the amount paid by the user of the network, knowing that the user will take a shortest st-path once the tariffs are fixed. Roch, Savard, and Marcotte (Networks, Vol. 46(1), 57–67, 2005) proved that this problem is NP-hard, and gave an O(...
متن کاملAn approximation algorithm for Stackelberg network pricing
We consider the problem of maximizing the revenue raised from tolls set on the arcs of a transportation network, under the constraint that users are assigned to toll-compatible shortest paths. We first prove that this problem is strongly NP-hard. We then provide a polynomial time algorithm with a worst-case precision guarantee of 12 log2 mT +1, where mT denotes the number of toll arcs. Finally ...
متن کاملPricing and Advertising Decisions in a Three-level Supply Chain with Nash, Stackelberg and Cooperative Games
Pricing and advertising are two important marketing strategies in the supply chain management which lead to customer demand’s increase and therefore higher profit for members of supply chains. This paper considers advertising, and pricing decisions simultaneously for a three-level supply chain with one supplier, one manufacturer and one retailer. The amount of market demand is influenced ...
متن کاملReputation drives cooperative behaviour and network formation in human groups
Cooperativeness is a defining feature of human nature. Theoreticians have suggested several mechanisms to explain this ubiquitous phenomenon, including reciprocity, reputation, and punishment, but the problem is still unsolved. Here we show, through experiments conducted with groups of people playing an iterated Prisoner's Dilemma on a dynamic network, that it is reputation what really fosters ...
متن کاملA Nash Bargaining Solution for Cooperative Network Formation Games
The Network Formation problem has received increasing attention in recent years. Previous works have addressed this problem considering only networks designed by sel sh users, which can be consistently suboptimal. This paper addresses the network formation issue using cooperative game theory, which permits to study ways to enforce and sustain cooperation among agents. Both the Nash bargaining s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cuadernos de Economía
سال: 2014
ISSN: 2248-4337,0121-4772
DOI: 10.15446/cuad.econ.v33n63.45336